An improved monotone algorithm for scheduling related machines with precedence constraints

نویسنده

  • Anke van Zuylen
چکیده

We answer an open question posed by Krumke, Schwahn, van Stee and Westphal by showing how to turn the algorithm by Chekuri and Bender for scheduling related machines with precedence constraints into a O(logm)-approximation algorithm that is monotone in expectation. This significantly improves on the previously best known monotone approximation algorithms for this problem, by Krumke et al. and Thielen and Krumke, which have an approximation guarantee of O(m).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A monotone approximation algorithm for scheduling with precedence constraints

We provide a monotone O(m)-approximation algorithm for scheduling related machines with precedence constraints.

متن کامل

A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints

We provide a general scheme for constructing monotone algorithms for a wide class C of scheduling problems Q|prec, rj |γ on related machines with precedence constraints and/or release dates. Our scheme works in the offline and the online setting. It takes as input two approximation/competitive algorithms for the (simpler) scheduling problems P |prec, rj |γ on identical machines and 1|prec, rj |...

متن کامل

Multi-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints

This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...

متن کامل

SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT

In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Oper. Res. Lett.

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2011